Bounds on Information Combining With Quantum Side Information
نویسندگان
چکیده
منابع مشابه
Bounds on Information Combining With Quantum Side Information
Bounds on information combining” are entropic inequalities that determine how the information (entropy) of a set of random variables can change when these are combined in certain prescribed ways. Such bounds play an important role in classical information theory, particularly in coding and Shannon theory; entropy power inequalities are special instances of them. The arguably most elementary kin...
متن کاملBounds on mutual information for simple codes using information combining
For coded transmission over a memoryless channel, two kinds of mutual information are considered: the mutual information between a code symbol and its noisy observation and the overall mutual information between encoder input and decoder output. The overall mutual information is interpreted as a combination of the mutual informations associated with the individual code symbols. Thus, exploiting...
متن کاملClassical data compression with quantum side information
The problem of classical data compression when the decoder has quantum side information at his disposal is considered. This is a quantum generalization of the classical Slepian-Wolf theorem. The optimal compression rate is found to be H(X)−χ where H(X) is the Shannon entropy of the source and χ is the Holevo quantity of the ensemble describing the classicalquantum correlations between the sourc...
متن کاملPerformance Bounds for Sparse Signal Reconstruction with Multiple Side Information
In the context of compressive sensing (CS), this paper considers the problem of reconstructing sparse signals with the aid of other given correlated sources as multiple side information (SI). To address this problem, we propose a reconstruction algorithm with multiple SI (RAMSI) that solves a general weighted n-`1 norm minimization. The proposed RAMSI algorithm takes advantage of both CS and th...
متن کاملLP Bounds for Rate-Distortion with Variable Side Information
We consider a rate-distortion problem with side information at multiple decoders. Several upper and lower bounds have been proposed for this general problem or special cases of it. We provide an upper bound for general instances of this problem, which takes the form of a linear program, by utilizing random binning and simultaneous decoding techniques [1] and compare it with the existing bounds....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2842180